Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph
نویسندگان
چکیده
~'Ve presenl efficienl. algorithms faT' cllO'I'dal bipartite graphs. Both algorit.hms 'lise a doubly /c.1;icaf ordering of the bipaTii-fe adjacency 'IIIa-tri.r. The first algol'dhm. computes a perfect edge with.out I;ert.c): elimination ordering (l.nd 1-he second one tisls all ma:l:im,al c01l1plete bipartite sttbgrap/Js. Keywol'ds: Dcsiqll of algorithms. effieiellt a.lgorithms. chordal biJlortile graphs.
منابع مشابه
Recognizing Chordal-Bipartite Probe Graphs
A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such thatG can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph is called chordal-bipartite if it contains no chordless cycle of length strictly greater than 5. Such probe/non-probe completion problems have ...
متن کاملStrongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs
In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way. We consider two characteristic elimination orderings for strongly orderable graphs, one on the vertex set and the second on the edge set, and...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملConnected matchings in chordal bipartite graphs
A connected matching in a graph is a collection of edges that are pairwise disjoint but joined by another edge of the graph. Motivated by applications to Hadwiger’s conjecture, Plummer, Stiebitz, and Toft [13] introduced connected matchings and proved that, given a positive integer k, determining whether a graph has a connected matching of size at least k is NPcomplete. Cameron [4] proved that ...
متن کاملSequential Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, which is an ordering of the vertices such that, for each vertex v, the neighbors of v that occur later than v in the ordering form a clique. Akcoglu et al [2] define an extension of chordal graphs whereby the neighbors o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 55 شماره
صفحات -
تاریخ انتشار 1995